Special node (constituent code) processing for fast/simplified polar successive cancellation list (scl) decoder

ABSTRACT

An apparatus for constituent code processing in polar successive cancellation list (SCL) decoding and a method thereof. The apparatus includes a processor configured to determine an activation value I and a number r of the candidate paths, where I is a binary value and r is an integer, (I, r)=ƒ(R, k, m), ƒ is a function, R is a number indicating node reliability, k is an integer indicating a number of information nodes, and m is an integer indicating a number of leaf nodes; determine min 1 , min 2 , . . . , min q , wherein q is a number of least reliable bits; determine r candidate paths; determine path metrics PM t     j    of a codeword j for each candidate path t; and select r most probable paths based on PM t     j   .

PRIORITY

This application claims priority under 35 U.S.C. § 119(e) to a U.S.Provisional Patent Application filed on Jan. 11, 2018 in the UnitedStates Patent and Trademark Office and assigned Ser. No. 62/616,165, theentire contents of which are incorporated herein by reference.

FIELD

The present disclosure relates generally to communication systems, andmore particularly, to an apparatus and a method of special node(constituent node) processing for a fast/simplified polar successivecancellation list (SCL) decoder.

BACKGROUND

Due to a serial decoding feature of conventional successive cancellation(SC) and SCL decoding methods, long latency of a polar code decoderlimits the practical applications of a polar code. To improve decodinglatency, simplified successive cancellation list decoding (SSCL) appliesappropriate candidate path splitting and path metric updating on certaintypes of intermediate nodes that correspond to a smaller constituentpolar code structure called special nodes without deploying the explicitSCL decoding.

Examples of particular constituent codes that have been explored includeRate-0 code, which corresponds to a constituent code having noinformation bits; Rate-1 code, which corresponds to a constituent codehaving only information bits; Rate-R code, which corresponds to aconstituent repetition code; and Rate-S code, which corresponds to asingle parity check code.

In typical SSCL methods, there is no well-established logic indetermining the amount of path splitting in special nodes. In addition,there is no further differentiation within each special node type interms of processing, which fails to capture their different polarizationfeatures in polar decoding.

In general, there is a tradeoff in processing constituent codes betweenachieved latency reduction/hardware complexity and potential performancedegradation. Therefore, operating with the best possible tradeoff, i.e.,operating with best performance with given latency reduction/hardwarecomplexity, is an important target in a decoder design.

SUMMARY

According to one embodiment, an apparatus for constituent codeprocessing in polar successive cancellation list (SCL) decoding isprovided. The apparatus includes a processor configured to: determine anactivation value I and a number r of the candidate paths, where I is abinary value and r is an integer, (I, r)=ƒ(R, k, m), ƒ is a function, Ris a number indicating node reliability, k is an integer indicating anumber of information nodes, and m is an integer indicating a number ofleaf nodes; determine min₁, min₂, . . . , min_(q), wherein q is a numberof least reliable bits; determine r candidate paths; determine pathmetrics PM_(t) _(j) of a codeword j for each candidate path t; andselect r most probable paths based on PM_(t) _(j) .

According to one embodiment, a method of constituent code processing forpolar successive cancellation list (SCL) decoder is provided. The methodincludes determining an activation value I and a number r of thecandidate paths, where I is a binary value and r is an integer, (I,r)=ƒ(R, k, m), ƒ is a function, R is a number indicating nodereliability, k is an integer indicating a number of information nodes,and m is an integer indicating a number of leaf nodes; determining min₁,min₂, . . . , min_(q), wherein q is a number of least reliable bits;determining r candidate paths; determining path metrics PM_(t) _(j) of acodeword j for each candidate path t; and selecting r most probablepaths based on PM_(t) _(j) .

BRIEF DESCRIPTION OF THE DRAWINGS

The above and other aspects, features, and advantages of certainembodiments of the present disclosure will be more apparent from thefollowing detailed description, taken in conjunction with theaccompanying drawings, in which:

FIG. 1 is a flowchart for selecting candidate paths, according to anembodiment;

FIG. 2 is a block diagram of an apparatus for selecting candidate paths,according to an embodiment;

FIG. 3 is a block diagram of an apparatus for determining single paritycheck (SPC) code minimum index and absolute value searcher, according toan embodiment; and

FIG. 4 is a block diagram of an apparatus for determining an SPC-nodepath metric (PM), according to an embodiment;

FIG. 5 is a block diagram of an electronic device in a networkenvironment, according to an embodiment;

FIG. 6 is a block diagram of a program, according to one embodiment; and

FIG. 7 is a block diagram of a wireless communication module, a powermanagement module, and an antenna module of an electronic device,according to an embodiment.

DETAILED DESCRIPTION OF EMBODIMENTS OF THE PRESENT DISCLOSURE

Hereinafter, embodiments of the present disclosure are described indetail with reference to the accompanying drawings. It should be notedthat the same elements will be designated by the same reference numeralsalthough they are shown in different drawings. In the followingdescription, specific details such as detailed configurations andcomponents are merely provided to assist with the overall understandingof the embodiments of the present disclosure. Therefore, it should beapparent to those skilled in the art that various changes andmodifications of the embodiments described herein may be made withoutdeparting from the scope of the present disclosure. In addition,descriptions of well-known functions and constructions are omitted forclarity and conciseness. The terms described below are terms defined inconsideration of the functions in the present disclosure, and may bedifferent according to users, intentions of the users, or customs.Therefore, the definitions of the terms should be determined based onthe contents throughout this specification.

The present disclosure may have various modifications and variousembodiments, among which embodiments are described below in detail withreference to the accompanying drawings. However, it should be understoodthat the present disclosure is not limited to the embodiments, butincludes all modifications, equivalents, and alternatives within thescope of the present disclosure.

Although the terms including an ordinal number such as first, second,etc. may be used for describing various elements, the structuralelements are not restricted by the terms. The terms are only used todistinguish one element from another element. For example, withoutdeparting from the scope of the present disclosure, a first structuralelement may be referred to as a second structural element. Similarly,the second structural element may also be referred to as the firststructural element. As used herein, the term “and/or” includes any andall combinations of one or more associated items.

The terms used herein are merely used to describe various embodiments ofthe present disclosure but are not intended to limit the presentdisclosure. Singular forms are intended to include plural forms unlessthe context clearly indicates otherwise. In the present disclosure, itshould be understood that the terms “include” or “have” indicateexistence of a feature, a number, a step, an operation, a structuralelement, parts, or a combination thereof, and do not exclude theexistence or probability of the addition of one or more other features,numerals, steps, operations, structural elements, parts, or combinationsthereof.

Unless defined differently, all terms used herein have the same meaningsas those understood by a person skilled in the art to which the presentdisclosure belongs. Terms such as those defined in a generally useddictionary are to be interpreted to have the same meanings as thecontextual meanings in the relevant field of art, and are not to beinterpreted to have ideal or excessively formal meanings unless clearlydefined in the present disclosure.

The present disclosure concerns an apparatus and a method of specialnode (constituent node) processing for a fast/simplified polar SCLdecoder.

In typical SSCL methods, there is no explicit consideration ofgenerating candidate paths with the highest reliabilities when applyingpath splitting.

FIG. 1 is a flowchart for selecting candidate paths, according to anembodiment.

Referring to FIG. 1, at 101, the present system determines an activationI and a number r of candidate paths (e.g., in a first processor) as (I,r)=ƒ(R, k, m), where I is a binary value, r is an integer, ƒ is afunction, R is a number indicating node reliability, k is an integerindicating a number of information nodes, m is an integer indicating anumber of leaf nodes. In addition, path_(s) is a current path and α_(v)is a vector of length m that indicates LLRs of node v.

For example, if an SPC node is k=m−1 and I=1 for all SPC nodes, ƒ(R,k=m−1, m)=(I, r)=(1, 4) if v ∈ R_(g), and ƒ(R, k=m−1, m)=(I, r)=(0, 0)otherwise, where R_(g) is a region of a second half of a polar codetree, and where reliability R is characterized by node location.

At 103, the present system determines min₁, min₂, . . . , min_(q) (e.g.,in a second processor) based on α_(v), where q is a number of leastreliable bits in h(α_(v)[i]), {min_(j)} are indices of the q leastreliable bits with relation α_(v)[min₁]≤α_(v)[min₂]≤ . . .≤α_(v)[min_(q)]., and i and j are integers.

For example, if an SPC node is k=m−1, I=1, r=4 for any R and m, and ƒ(R,m−1, m)=(1, 4), and q=4, four minimum elements are found in |α_(v)|,where α_(v) is a vector of length m that indicates an incoming LLR fornode v. In general, the smallest q may be found for an r, k, and m.

At 105, the present system determines candidate paths r (e.g., in athird processor).

At 107, the present system determines path metrics PM_(t) _(j) ofpotential codeword j for each candidate path (e.g., in a fourthprocessor).

For example, a path metric PM_(t) of the candidate path t is generatedas PM_(t)=PM_(s)−Σ_(i)|β_(t)[i]−h(α_(v)[i])|×|α_(v)[i]|, where PM_(s) isan incoming path metric, β_(t) is a candidate codeword of node v,h(α_(v)[i]) is hard decision of α_(v)[i], and PM_(t) is the reliabilityof candidate path t. β_(t) may satisfy ⊕_(i)β_(t)[i]=0 in SPC node. Themost likely (ML) candidate (subject to ⊕_(i)β_(t)[i]=0) isβ_(t)[i]=h(α_(v)[i]) with PM_(t)=PM_(s). PM_(t) of other candidates maybe generated by using q=4 minimum elements in |α_(v)|.

At 109, the present system selects r of the most probable paths based on{PM_(t) _(j) } (e.g., in a fifth processor).

For example, four (e.g., r=4) most probable paths may be found asPM_(t,1), PM_(t,2), PM_(t,3), and max(PM_(t,4), PM_(t,5)), wherePM_(t,1)≥PM_(t,2)≥PM_(t,3)≥PM_(t,4), PM_(t,5), PM_(t) ₁=PM_(s)−(1−p)|α_(v)[min₁]| (flips the least reliable bit of h(α_(v)[i])when p=0), PM_(t) ₂ =PM_(s)−p|α_(v)[min₁]|−|α_(v)[min₂]| (flips theleast 2 reliable bits of h(α_(v)[i]) depending on p), PM_(t) ₃=PM_(s)−p|α_(v)[min₁]|−|α_(v)[min₃]| (flips 2 of unreliable bits ofh(α_(v)[i]) depending on p), PM_(t) ₄=PM_(s)−p|α_(v)[min₁]|−α_(v)[min₄]| (flips 2 of unreliable bits ofh(α_(v)[i]) depending on p), PM_(t) ₅=PM_(s)−(1−p)|α_(v)[min₁]|−|α_(v)[min₂]|−|α_(v)[min₃]| (flips the least3 reliable bits of h(α_(v)[i]) depending on p), and p=1−⊕_(i)h(α_(v)[i])reflects the structure constraint of SPC node.

The present system and method may be applied to special nodes havingsimplified processing, as well as any general type of constituent codeswith arbitrary size m having k information leaf nodes, 0≤k≤m, by usingthe systematic candidate paths pruning process as described above withreference to FIG. 1.

For example, a single parity check (SPC) node may be processed that hasall leaf nodes as information bits except the first one. An SPC node isan example of a typical special node. In a case where r is 4, and a pathmetric is PM_(t)=PM_(s)−Σ_(i)|β_(t)[i]−h(α_(v)[i])|×|α_(v)[i]|, itsuffices to consider four least reliable bits (i.e., q=4), and thefollowing five potential candidates in Equations (1)-(5) as follows:

PM_(t) ₁ =PM_(s)−(1−p)|α_(v)[min₁]| (flips the least reliable bit ofh(α_(v)[i]) when p=0),   (1)

PM_(t) ₂ =PM_(s) −p|α _(v)[min₁]|−|α_(v)[min₂]| (flips the least 2reliable bits of h(α_(v)[i]) depending on p),   (2)

PM_(t) ₃ =PM_(s) −p|α _(v)[min₁]|−|α_(v)[min₃]| (flips 2 of unreliablebits of h(α_(v)[i]) depending on p),   (3)

PM_(t) ₄ =PM_(s) −p|α _(v)[min₁]|−|α_(v)[min₄]| (flips 2 of unreliablebits of h(α_(v)[i]) depending on p),   (4)

PM_(t) ₅ =PM_(s)−(1−p)|α_(v)[min₁]|−|α_(v)[min₂]|−|α_(v)[min₃]| (flipsthe least 3 reliable bits of h(α_(v)[i]) depending on p),   (5)

where p=1−⊕_(i) h(α_(v)[i]).

In this case, PM_(t,1)≥PM_(t,2)≥PM_(t,3)≥PM_(t,4), PM_(t,5), so the fourmost probable candidate paths have path metrics PM_(t,1), PM_(t,2),PM_(t,3), and max(PM_(t,4), PM_(t,5)). The present system determiningthe r most reliable candidate paths may be conducted in a fairlyefficient manner in most practical situations by appropriatelyconsidering flipping certain combinations of q least reliable bits inh(α_(v)[i]).

According to an embodiment, the function ƒ(R, k, m)=(I, r) may be aconstant function for an SPC node, i.e., all the SPC nodes in thedecoding tree structure are processed by considering a fixed number r ofcandidate paths. A more general form of ƒ can provide a better tradeoffbetween latency reduction/hardware complexity and potential performancedegradation. A generalization may be considered that provides alocation-based determination of I. For example, (I, r)=(1, 4) if v ∈R_(g), (I, r)=(0, 0), otherwise, for an SPC node v. Thus, reliability Ris being determined by the location of a node.

FIG. 2 is a block diagram of an apparatus 200 for selecting candidatepaths, according to an embodiment.

Referring to FIG. 2, the apparatus 200 includes a node type identifier201, a reliability identifier 203, an activation identifier 207, anactivator 213, and a node processor 215.

The node type identifier 201 includes a first input for receiving polarsequence information, a second input for receiving current depth (d) andcurrent node index (i), and an output for providing integers k and m,where k indicates a number of information nodes, and m indicates anumber of leaf nodes.

The reliability identifier 203 includes an input for receiving d and i,and an output for providing an integer R, which indicates nodereliability. The reliability identifier 203 includes multiplexer 205that includes a first input for receiving an integer 0, a second inputfor receiving an integer 1, and a third control input for receiving iand multiplexing between 0 and 1 to provide R based on determiningwhether i is greater than 0.5×2̂d or not.

The activation identifier 207 includes a first input connected to theoutput of the node type identifier 201 for receiving k and m, a secondinput connected to the output of the reliability identifier 203 toreceive R, a first output for providing r, and a second output forproviding I, where r indicates a number of candidate codewords, andwhere I indicates either that the activator 213 should be activated or ior d should be incremented. The activation identifier includes a firstmultiplexer 209 and a second multiplexer 211. The first multiplexer 209includes a first input for receiving a value 1, a second input forreceiving a value 2, a third input for receiving a value 4, a firstcontrol input for receiving k and determining if k is greater than 0, asecond control input for receiving k and determining if k is greaterthan 1, and an output for providing r. The second multiplexer 211includes a first input for receiving a value 0, a second input forreceiving a value 1, a control input for receiving k and R anddetermining if k is equal to 0, k is equal to m, k is equal to 1, or kis equal to m−1 or R is equal to 1; and an output for providing I, whereI has a value of 0 or 1.

The activator 213 includes an input connected to the second output ofthe activation identifier 207 for receiving I, a first output forincrementing i if i is less than 2̂d or incrementing d otherwise when Iis equal to 0, and a second output for providing k and m when I is equalto 1. The activation identifier 207 and the activator 213 perform step101 of FIG. 1.

The node processor 215 includes a first input for receiving an incominglog-likelihood ration (RRL) α_(v) and a current path path_(s), a secondinput for receiving d and i, a third input connected to the output ofthe activation identifier 207 for receiving r, a fourth input connectedto the second output of the activator 213 for receiving k and m, and anoutput for providing an r number of PM_(tj) for further SSCL. The nodeprocessor 215 performs steps 103, 105, 107, and 109 of FIG. 1.

FIG. 3 is a block diagram of an apparatus 300 for determining SPC-codeminimum index and an absolute value (abs) searcher, according to anembodiment.

According to one embodiment, the apparatus 300 performs step 103 of FIG.1, where q is 4. In an embodiment, the activation indicator I is 1 whiler is 4 in step 101 of FIG. 1. That is, (I=1, r=4)=ƒ(R, k, m) for any Rand k while k=m−1 for an SPC node. FIG. 3 may also have min₀, min₁,min₂, min₃ updaters as well as a rate sorter as a component block.

The apparatus 300 includes a rate sorter 301, a flip-flop 303, aflip-flop 305, a flip-flop 309, an adder 307, a min₀ updater 311, a min₁updater 313, a min₂ updater 315, and a min₃ updater 317. Rate sorter 301determines the 4 minimum absolute LLRs and the associated indices from20 input LLRs. Function block 309 accumulates the number of LLRs whichhave been sorted. min₀ updater 311, min₁ updater 313, min₂ updater 315,and min₃ updater 317 are used to store the 4 minimum absolute LLRs fromrate sorter 301 and calculate the associated indices from rate sorter301 and function block 309.

FIG. 4 is a block diagram of an apparatus 400 for determining SPC-nodePM, according to an embodiment.

According to one embodiment, the apparatus 400 performs steps 107 and109 of FIG. 1, where r is 4.

The apparatus 400 includes a first multiplexer 401, a second multiplexer403, a first sum block 405, a second sum block 407, a third sum block409, a fourth sum block 411, a fifth sum block 413, a comparator 415, athird multiplexer 417, a sixth sum block 419, a first satisfaction (sat)block 421, a second sat block 423, a third sat block 425, a fourth satblock 427, a flip-flop 429, a flip-flop 431, a flip-flop 433, and aflip-flop 435. Multiplexer 401 and multiplexer 403 determine(1−p)|α_(v)[min₁]| and p|α_(v)[min₁]|, respectively. Sum block 405, sumblock 407, and sum block 409 are used to calculate PM_(t) ₁=PM_(s)−(1−p)|α_(v)[min₁]|, PM_(t) ₂=PM_(s)−p|α_(v)[min₁]|−|α_(v)[min₂]|, and PM_(t) ₃=PM_(s)−p|α_(v)[min₁]|−|α_(v)[min₃]|, respectively. Comparator 415 andmultiplexer 417 select minimum from either sum block 411 whichcalculates p|α_(v)[min₁]|−|α_(v)[min₄]| or sum block 413 whichcalculates (1−p)|α_(v)[min₁]|−|α_(v)[min₂]|−|α_(v)[min₃]|. Sum block 419calculates PM_(s)−min((1−p)|α_(v)[min₁]|−|α_(v)[min₂]|−|α_(v)[min₃]|,p|α_(v)[min₁]|−|α_(v)[min₄]|).

According to an embodiment, the present system and method providesprocessing of constituent codes from SSCL decoding of polar codes,including determining an activation indicator I and a number ofcandidate paths r for processing a constituent code based on reliabilityR, a number of information nodes k, and a number of leaf nodes m of aconstituent code, where the activation indicator I indicates whether theconstituent code may be decoded without traversing a sub-tree. Thepresent system and method further determines candidate path metrics ofpotential codewords of the number of candidate paths by flippingcombinations of least reliable bits that satisfy constraints imposed bythe constituent code, and determines a number of most probable candidatepaths among potential codewords.

FIG. 5 is a block diagram of an electronic device 501 in a networkenvironment 500, according to an embodiment.

Referring to FIG. 5, the electronic device 501 in the networkenvironment 500 may communicate with an electronic device 502 via afirst network 598 (e.g., a short-range wireless communication network),or an electronic device 504 or a server 508 via a second network 599(e.g., a long-range wireless communication network). According to anembodiment, the electronic device 501 may communicate with theelectronic device 504 via the server 508. The electronic device 501 mayinclude a processor 520, a memory 530, an input device 550, a soundoutput device 555, a display device 560, an audio module 570, a sensormodule 576, an interface 577, a haptic module 579, a camera module 580,a power management module 588, a battery 589, a communication module590, a subscriber identification module (SIM) 596, or an antenna module597. In an embodiment, at least one (e.g., the display device 560 or thecamera module 580) of the components may be omitted from the electronicdevice 501, or one or more other components may be added to theelectronic device 501. In an embodiment, some of the components may beimplemented as a single integrated circuit (IC). For example, the sensormodule 576 (e.g., a fingerprint sensor, an iris sensor, or anilluminance sensor) may be embedded in the display device 560 (e.g., adisplay).

The processor 520 may execute, for example, software (e.g., a program540) to control at least one other component (e.g., a hardware or asoftware component) of the electronic device 501 coupled with theprocessor 520, and may perform various data processing or computations.According to one embodiment, as at least part of the data processing orcomputations, the processor 520 may load a command or data received fromanother component (e.g., the sensor module 576 or the communicationmodule 590) in volatile memory 532, process the command or the datastored in the volatile memory 532, and store resulting data innon-volatile memory 534. According to an embodiment, the processor 520may include a main processor 521 (e.g., a central processing unit (CPU)or an application processor (AP)), and an auxiliary processor 523 (e.g.,a graphics processing unit (GPU), an image signal processor (ISP), asensor hub processor, or a communication processor (CP)) that isoperable independently from, or in conjunction with, the main processor521. Additionally or alternatively, the auxiliary processor 523 may beadapted to consume less power than the main processor 521, or execute aparticular function. The auxiliary processor 523 may be implemented asbeing separate from, or a part of, the main processor 521.

The auxiliary processor 523 may control at least some of the functionsor states related to at least one component (e.g., the display device560, the sensor module 576, or the communication module 590) among thecomponents of the electronic device 501, instead of the main processor521 while the main processor 521 is in an inactive (e.g., sleep) state,or together with the main processor 521 while the main processor 521 isin an active state (e.g., executing an application). According to anembodiment, the auxiliary processor 523 (e.g., an image signal processoror a communication processor) may be implemented as part of anothercomponent (e.g., the camera module 580 or the communication module 590)functionally related to the auxiliary processor 523.

The memory 530 may store various data used by at least one component(e.g., the processor 520 or the sensor module 576) of the electronicdevice 501. The various data may include, for example, software (e.g.,the program 540) and input data or output data for a command relatedthererto. The memory 530 may include the volatile memory 532 or thenon-volatile memory 534.

The program 540 may be stored in the memory 530 as software, and mayinclude, for example, an operating system (OS) 542, middleware 544, oran application 546.

The input device 550 may receive a command or data to be used by othercomponent (e.g., the processor 520) of the electronic device 501, fromthe outside (e.g., a user) of the electronic device 501. The inputdevice 550 may include, for example, a microphone, a mouse, or akeyboard.

The sound output device 555 may output sound signals to the outside ofthe electronic device 501. The sound output device 555 may include, forexample, a speaker or a receiver. The speaker may be used for generalpurposes, such as playing multimedia or recording, and the receiver maybe used for receiving an incoming call. According to an embodiment, thereceiver may be implemented as being separate from, or a part of, thespeaker.

The display device 560 may visually provide information to the outside(e.g., a user) of the electronic device 501. The display device 560 mayinclude, for example, a display, a hologram device, or a projector andcontrol circuitry to control a corresponding one of the display,hologram device, and projector. According to an embodiment, the displaydevice 560 may include touch circuitry adapted to detect a touch, orsensor circuitry (e.g., a pressure sensor) adapted to measure theintensity of force incurred by the touch.

The audio module 570 may convert a sound into an electrical signal andvice versa. According to an embodiment, the audio module 570 may obtainthe sound via the input device 550, or output the sound via the soundoutput device 555 or a headphone of an external electronic device (e.g.,electronic device 502) directly (e.g., wiredly) or wirelessly coupledwith the electronic device 501.

The sensor module 576 may detect an operational state (e.g., power ortemperature) of the electronic device 501 or an environmental state(e.g., a state of a user) external to the electronic device 501, andthen generate an electrical signal or data value corresponding to thedetected state. According to an embodiment, the sensor module 576 mayinclude, for example, a gesture sensor, a gyro sensor, an atmosphericpressure sensor, a magnetic sensor, an acceleration sensor, a gripsensor, a proximity sensor, a color sensor, an infrared (IR) sensor, abiometric sensor, a temperature sensor, a humidity sensor, or anilluminance sensor.

The interface 577 may support one or more specified protocols to be usedfor the electronic device 501 to be coupled with the external electronicdevice (e.g., the electronic device 502) directly (e.g., wiredly) orwirelessly. According to an embodiment, the interface 577 may include,for example, a high definition multimedia interface (HDMI), a universalserial bus (USB) interface, a secure digital (SD) card interface, or anaudio interface.

A connecting terminal 578 may include a connector via which theelectronic device 501 may be physically connected with the externalelectronic device (e.g., the electronic device 502). According to anembodiment, the connecting terminal 578 may include, for example, anHDMI connector, a USB connector, an SD card connector, or an audioconnector (e.g., a headphone connector).

The haptic module 579 may convert an electrical signal into a mechanicalstimulus (e.g., a vibration or a movement) or an electrical stimuluswhich may be recognized by a user via tactile sensation or kinestheticsensation. According to an embodiment, the haptic module 579 mayinclude, for example, a motor, a piezoelectric element, or an electricalstimulator.

The camera module 580 may capture a still image or moving images.According to an embodiment, the camera module 580 may include one ormore lenses, image sensors, image signal processors, or flashes.

The power management module 588 may manage power supplied to theelectronic device 501. According to one embodiment, the power managementmodule 588 may be implemented as at least part of, for example, a powermanagement integrated circuit (PMIC).

The battery 589 may supply power to at least one component of theelectronic device 501. According to an embodiment, the battery 589 mayinclude, for example, a primary cell which is not rechargeable, asecondary cell which is rechargeable, or a fuel cell.

The communication module 590 may support establishing a direct (e.g.,wired) communication channel or a wireless communication channel betweenthe electronic device 501 and the external electronic device (e.g., theelectronic device 502, the electronic device 504, or the server 508) andperforming communication via the established communication channel. Thecommunication module 590 may include one or more communicationprocessors that are operable independently from the processor 520 (e.g.,the AP) and supports a direct (e.g., wired) communication or a wirelesscommunication. According to an embodiment, the communication module 590may include a wireless communication module 592 (e.g., a cellularcommunication module, a short-range wireless communication module, or aglobal navigation satellite system (GNSS) communication module) or awired communication module 594 (e.g., a local area network (LAN)communication module or a power line communication (PLC) module). Acorresponding one of these communication modules may communicate withthe external electronic device via the first network 598 (e.g., ashort-range communication network, such as Bluetooth™, wireless-fidelity(Wi-Fi) direct, or a standard of the Infrared Data Association (IrDA))or the second network 599 (e.g., a long-range communication network,such as a cellular network, the Internet, or a computer network (e.g.,LAN or wide area network (WAN)). These various types of communicationmodules may be implemented as a single component (e.g., a single IC), ormay be implemented as multiple components (e.g., multiple ICs) that areseparate from each other. The wireless communication module 592 mayidentify and authenticate the electronic device 501 in a communicationnetwork, such as the first network 598 or the second network 599, usingsubscriber information (e.g., international mobile subscriber identity(IMSI)) stored in the subscriber identification module 596.

The antenna module 597 may transmit or receive a signal or power to orfrom the outside (e.g., the external electronic device) of theelectronic device 501. According to an embodiment, the antenna module597 may include one or more antennas, and, therefrom, at least oneantenna appropriate for a communication scheme used in the communicationnetwork, such as the first network 598 or the second network 599, may beselected, for example, by the communication module 590 (e.g., thewireless communication module 592). The signal or the power may then betransmitted or received between the communication module 590 and theexternal electronic device via the selected at least one antenna.

At least some of the above-described components may be mutually coupledand communicate signals (e.g., commands or data) therebetween via aninter-peripheral communication scheme (e.g., a bus, a general purposeinput and output (GPIO), a serial peripheral interface (SPI), or amobile industry processor interface (MIPI)).

According to an embodiment, commands or data may be transmitted orreceived between the electronic device 501 and the external electronicdevice 504 via the server 508 coupled with the second network 599. Eachof the electronic devices 502 and 504 may be a device of a same type as,or a different type, from the electronic device 501. According to anembodiment, all or some of operations to be executed at the electronicdevice 501 may be executed at one or more of the external electronicdevices 502, 504, or 508. For example, if the electronic device 501should perform a function or a service automatically, or in response toa request from a user or another device, the electronic device 501,instead of, or in addition to, executing the function or the service,may request the one or more external electronic devices to perform atleast part of the function or the service. The one or more externalelectronic devices receiving the request may perform the at least partof the function or the service requested, or an additional function oran additional service related to the request, and transfer an outcome ofthe performing to the electronic device 501. The electronic device 501may provide the outcome, with or without further processing of theoutcome, as at least part of a reply to the request. To that end, acloud computing, distributed computing, or client-server computingtechnology may be used, for example.

The electronic device according to an embodiment may be one of varioustypes of electronic devices. The electronic devices may include, forexample, a portable communication device (e.g., a smart phone), acomputer, a portable multimedia device, a portable medical device, acamera, a wearable device, or a home appliance. According to anembodiment of the disclosure, an electronic device is not limited tothose described above.

The terms used in the present disclosure are not intended to limit thepresent disclosure but are intended to include various changes,equivalents, or replacements for a corresponding embodiment. With regardto the descriptions of the accompanying drawings, similar referencenumerals may be used to refer to similar or related elements. A singularform of a noun corresponding to an item may include one or more of thethings, unless the relevant context clearly indicates otherwise. As usedherein, each of such phrases as “A or B,” “at least one of A and B,” “atleast one of A or B,” “A, B, or C,” “at least one of A, B, and C,” and“at least one of A, B, or C,” may include all possible combinations ofthe items enumerated together in a corresponding one of the phrases. Asused herein, terms such as “1^(st),” “2nd,” “first,” and “second” may beused to distinguish a corresponding component from another component,but are not intended to limit the components in other aspects (e.g.,importance or order). It is intended that if an element (e.g., a firstelement) is referred to, with or without the term “operatively” or“communicatively”, as “coupled with,” “coupled to,” “connected with,” or“connected to” another element (e.g., a second element), it indicatesthat the element may be coupled with the other element directly (e.g.,wiredly), wirelessly, or via a third element.

As used herein, the term “module” may include a unit implemented inhardware, software, or firmware, and may interchangeably be used withother terms, for example, “logic,” “logic block,” “part,” and“circuitry.” A module may be a single integral component, or a minimumunit or part thereof, adapted to perform one or more functions. Forexample, according to an embodiment, a module may be implemented in aform of an application-specific integrated circuit (ASIC).

An embodiment may be implemented as software (e.g., the program 540)including one or more instructions that are stored in a storage medium(e.g., internal memory 536 or external memory 538) that is readable by amachine (e.g., the electronic device 501). For example, a processor(e.g., the processor 520) of the machine may invoke at least one of theone or more instructions stored in the storage medium, and execute it,with or without using one or more other components under the control ofthe processor. Thus, a machine may be operated to perform at least onefunction according to the at least one instruction invoked. The one ormore instructions may include code generated by a complier or codeexecutable by an interpreter. A machine-readable storage medium may beprovided in the form of a non-transitory storage medium. The term“non-transitory” indicates that the storage medium is a tangible device,and does not include a signal (e.g., an electromagnetic wave), but thisterm does not differentiate between where data is semi-permanentlystored in the storage medium and where the data is temporarily stored inthe storage medium.

According to an embodiment, a method of the disclosure may be includedand provided in a computer program product. The computer program productmay be traded as a product between a seller and a buyer. The computerprogram product may be distributed in the form of a machine-readablestorage medium (e.g., a compact disc read only memory (CD-ROM)), or bedistributed (e.g., downloaded or uploaded) online via an applicationstore (e.g., Play Store™), or between two user devices (e.g., smartphones) directly. If distributed online, at least part of the computerprogram product may be temporarily generated or at least temporarilystored in the machine-readable storage medium, such as memory of themanufacturer's server, a server of the application store, or a relayserver.

According to an embodiment, each component (e.g., a module or a program)of the above-described components may include a single entity ormultiple entities. According to an embodiment, one or more of theabove-described components may be omitted, or one or more othercomponents may be added. Alternatively or additionally, a plurality ofcomponents (e.g., modules or programs) may be integrated into a singlecomponent. In this case, the integrated component may still perform oneor more functions of each of the plurality of components in the same orsimilar manner as they are performed by a corresponding one of theplurality of components before the integration. According to anembodiment, operations performed by the module, the program, or anothercomponent may be carried out sequentially, in parallel, repeatedly, orheuristically, or one or more of the operations may be executed in adifferent order or omitted, or one or more other operations may beadded.

FIG. 6 is a block diagram of the program 540 according to an embodiment.

Referring to FIG. 6, the program 540 may include an OS 542 to controlone or more resources of the electronic device 501, middleware 544, oran application 546 executable in the OS 542. The OS 542 may include, forexample, Android®, iOS®, Windows®, Symbian®, Tizen®, or Bada™. At leastpart of the program 540, for example, may be pre-loaded on theelectronic device 501 during manufacture, or may be downloaded from orupdated by an external electronic device (e.g., the electronic device502 or 504, or the server 508) during use by a user.

The OS 542 may control management (e.g., allocating or deallocation) ofone or more system resources (e.g., process, memory, or power source) ofthe electronic device 501. The OS 542, additionally or alternatively,may include one or more driver programs to drive other hardware devicesof the electronic device 501, for example, the input device 550, thesound output device 555, the display device 560, the audio module 570,the sensor module 576, the interface 577, the haptic module 579, thecamera module 580, the power management module 588, the battery 589, thecommunication module 590, the subscriber identification module 596, orthe antenna module 597.

The middleware 544 may provide various functions to the application 546such that a function or information provided from one or more resourcesof the electronic device 501 may be used by the application 546. Themiddleware 544 may include, for example, an application manager 601, awindow manager 603, a multimedia manager 605, a resource manager 607, apower manager 609, a database manager 611, a package manager 613, aconnectivity manager 615, a notification manager 617, a location manager619, a graphic manager 621, a security manager 623, a telephony manager625, or a voice recognition manager 627.

The application manager 601, for example, may manage the life cycle ofthe application 546. The window manager 603, for example, may manage oneor more graphical user interface (GUI) resources that are used on ascreen. The multimedia manager 605, for example, may identify one ormore formats to be used to play media files, and may encode or decode acorresponding one of the media files using a codec appropriate for acorresponding format selected from the one or more formats. The resourcemanager 607, for example, may manage the source code of the application546 or a memory space of the memory 530. The power manager 609, forexample, may manage the capacity, temperature, or power of the battery589, and determine or provide related information to be used for theoperation of the electronic device 501 based at least in part oncorresponding information of the capacity, temperature, or power of thebattery 589. According to an embodiment, the power manager 609 mayinteroperate with a basic input/output system (BIOS) of the electronicdevice 501.

The database manager 611, for example, may generate, search, or change adatabase to be used by the application 546. The package manager 613, forexample, may manage installation or update of an application that isdistributed in the form of a package file. The connectivity manager 615,for example, may manage a wireless connection or a direct connectionbetween the electronic device 501 and the external electronic device.The notification manager 617, for example, may provide a function tonotify a user of an occurrence of a specified event (e.g., an incomingcall, message, or alert). The location manager 619, for example, maymanage locational information on the electronic device 501. The graphicmanager 621, for example, may manage one or more graphic effects to beoffered to a user or a user interface related to the one or more graphiceffects.

The security manager 623, for example, may provide system security oruser authentication. The telephony manager 625, for example, may managea voice call function or a video call function provided by theelectronic device 501. The voice recognition manager 627, for example,may transmit a user's voice data to the server 508, and receive, fromthe server 508, a command corresponding to a function to be executed onthe electronic device 501 based at least in part on the voice data, ortext data converted based at least in part on the voice data. Accordingto an embodiment, the middleware 544 may dynamically delete someexisting components or add new components. According to an embodiment,at least part of the middleware 544 may be included as part of the OS542 or may be implemented in other software separate from the OS 542.

The application 546 may include, for example, a home application 651, adialer application 653, a short message service (SMS)/multimediamessaging service (MMS) application 655, an instant message (IM)application 657, a browser application 659, a camera application 661, analarm application 663, a contact application 665, a voice recognitionapplication 667, an email application 669, a calendar application 671, amedia player application 673, an album application 675, a watchapplication 677, a health application 679 (e.g., for measuring thedegree of workout or biometric information, such as blood sugar), or anenvironmental information application 681 (e.g., for measuring airpressure, humidity, or temperature information). According to anembodiment, the application 546 may further include an informationexchanging application that is capable of supporting informationexchange between the electronic device 501 and the external electronicdevice. The information exchange application, for example, may include anotification relay application adapted to transfer designatedinformation (e.g., a call, a message, or an alert) to the externalelectronic device or a device management application adapted to managethe external electronic device. The notification relay application maytransfer notification information corresponding to an occurrence of aspecified event (e.g., receipt of an email) at another application(e.g., the email application 669) of the electronic device 501 to theexternal electronic device. Additionally or alternatively, thenotification relay application may receive notification information fromthe external electronic device and provide the notification informationto a user of the electronic device 501.

The device management application may control the power (e.g., turn-onor turn-off) or the function (e.g., adjustment of brightness,resolution, or focus) of the external electronic device or somecomponent thereof (e.g., a display device or a camera module of theexternal electronic device). The device management application,additionally or alternatively, may support installation, delete, orupdate of an application running on the external electronic device.

FIG. 7 is a block diagram of the wireless communication module 592, thepower management module 588, and the antenna module 597 of theelectronic device 501, according to an embodiment.

Referring to FIG. 7, the wireless communication module 592 may include amagnetic secure transmission (MST) communication module 710 or anear-field communication (NFC) module 730, and the power managementmodule 588 may include a wireless charging module 750. In this case, theantenna module 597 may include a plurality of antennas that include anMST antenna 597-1 connected with the MST communication module 710, anNFC antenna 597-3 connected with the NFC communication module 730, and awireless charging antenna 597-5 connected with the wireless chargingmodule 750. Descriptions of components described above with regard toFIG. 5 are either briefly described or omitted here.

The MST communication module 710 may receive a signal containing controlinformation or payment information such as card (e.g., credit card)information from the processor 520, generate a magnetic signalcorresponding to the received signal, and then transfer the generatedmagnetic signal to the external electronic device 502 (e.g., apoint-of-sale (POS) device) via the MST antenna 597-1. To generate themagnetic signal, according to an embodiment, the MST communicationmodule 710 may include a switching module that includes one or moreswitches connected with the MST antenna 597-1, and control the switchingmodule to change the direction of voltage or current supplied to the MSTantenna 597-1 according to the received signal. The change of thedirection of the voltage or current allows the direction of the magneticsignal (e.g., a magnetic field) emitted from the MST antenna 597-1 tochange accordingly. If detected at the external electronic device 502,the magnetic signal with its direction changing may cause an effect(e.g., a waveform) similar to that of a magnetic field that is generatedwhen a magnetic card corresponding to the card information associatedwith the received signal is swiped through a card reader of theelectronic device 502. According to an embodiment, for example,payment-related information and a control signal that are received bythe electronic device 502 in the form of the magnetic signal may befurther transmitted to an external server 508 (e.g., a payment server)via the network 599.

The NFC communication module 730 may obtain a signal containing controlinformation or payment information such as card information from theprocessor 520 and transmit the obtained signal to the externalelectronic device 502 via the NFC antenna 597-3. According to anembodiment, the NFC communication module 730 may receive such a signaltransmitted from the external electronic device 502 via the NFC antenna597-3.

The wireless charging module 750 may wirelessly transmit power to theexternal electronic device 502 (e.g., a cellular phone or wearabledevice) via the wireless charging antenna 597-5, or wirelessly receivepower from the external electronic device 502 (e.g., a wireless chargingdevice). The wireless charging module 750 may support one or more ofvarious wireless charging schemes including, for example, a magneticresonance scheme or a magnetic induction scheme.

According to an embodiment, some of the MST antenna 597-1, the NFCantenna 597-3, or the wireless charging antenna 597-5 may share at leastpart of their radiators. For example, the radiator of the MST antenna597-1 may be used as the radiator of the NFC antenna 597-3 or thewireless charging antenna 597-5, or vice versa. In this case, theantenna module 597 may include a switching circuit adapted toselectively connect (e.g., close) or disconnect (e.g., open) at leastpart of the antennas 597-1, 597-3, and 597-5, for example, under controlof the wireless communication module 592 (e.g., the MST communicationmodule 710 or the NFC communication module 730) or the power managementmodule (e.g., the wireless charging module 750). For example, when theelectronic device 501 uses a wireless charging function, the NFCcommunication module 730 or the wireless charging module 750 may controlthe switching circuit to temporarily disconnect at least one portion ofthe radiators shared by the NFC antenna 597-3 and the wireless chargingantenna 597-5 from the NFC antenna 597-3 and to connect the at least oneportion of the radiators with the wireless charging antenna 597-5.

According to an embodiment, at least one function of the MSTcommunication module 710, the NFC communication module 730, or thewireless charging module 750 may be controlled by an external processor(e.g., the processor 520). According to an embodiment, at least onespecified function (e.g., a payment function) of the MST communicationmodule 710 or the NFC communication module 730 may be performed in atrusted execution environment (TEE). According to an embodiment, the TEEmay form an execution environment in which, for example, at least somedesignated area of the memory 730 is allocated to be used for performinga function (e.g., a financial transaction or personalinformation-related function) that requires a relatively high level ofsecurity. In this case, access to the at least some designated area ofthe memory 530 may be restrictively permitted, for example, according toan entity accessing thereto or an application being executed in the TEE.

The present system and method provides a special node (constituent code)processing scheme that achieves better tradeoff betweenlatency/complexity and performance. The present system and methodprovides functional characterization of special node processingparameters (activation, number of candidates) with dependency onpolarized reliability and node type. The present system and methodfurther provides a systematic approach to determine r most probablecodewords as candidate paths.

SC and SCL decoding on a polar code of length N=2^(n) may be mapped intoN leaf nodes binary tree traversing, where n is an integer. Each leafnode represents information or frozen bits. Each intermediate node inthe binary tree corresponds to a smaller constituent polar codestructure. To improve the decoding latency of SCL, SSCL appliesappropriate candidate path splitting and path metric updating on certaintypes of nodes without traveling the corresponding tree structure underSCL. The surviving paths in the list are pruned from the candidate pathsaccording to the path metrics.

In an embodiment, a node v has m leaf nodes, where m is an integer.Log-likelihood ratios (LLRs) of node v is α_(v), which is a vector oflength m. A decoding path s with path metric PM_(s) generates acandidate path t with path metric PM_(t) based on a candidate codewordβ_(t) of node v. A path metric which depends on α_(v) and β_(t)represents a likelihood of the path, and may take different forms.

For example, a path metric may bePM_(t)=PM_(s)−Σ_(i)|β_(t)[i]−h(α_(v)[i])|×|α_(v)[i]|, where h(α_(v)[i])is a hard decision of an ith element in α_(v), where i is an integer.For an integer r, PM_(t) ₁ , . . . , PM_(t) _(r) are generatedcorresponding to r candidate codewords β_(t) ₁ , . . . , β_(t) _(r) foreach list element.

According to an embodiment, the present system and method determines anactivation indicator I and a number of candidate paths r on processing aconstituent code (I, r)=ƒ(R, k, m), where I is a binary value, ƒ is afunction, R is a reliability, k is a number of information nodes, and mis a number of leaf nodes of a constituent code, where R is a number,and k and m are integers. The activation indicator has value 1 (e.g.,active) if the constituent code is decoded without traversing thesub-tree and 0 (e.g., inactive) otherwise. Reliability R may takedifferent forms. I and r have an impact on decoding latencyreduction/hardware complexity and potential performance degradation, andthe function ƒ may characterize the best tradeoff between the two. Thepresent system provides a location-based reliability determination asone realization of the function ƒ.

Once the activation indicator I and the number of candidate paths r aredetermined for an activated node, the present system and methoddetermines the r most probable candidate paths among the potentialcodewords for each list element. The r potential codewords have thehighest reliabilities to generate the candidate paths. The potentialcodewords of node v are obtained by flipping the binary values ofcertain combinations of q least reliable bits in h(α_(v)[i]) based onthe LLR vector α_(v) such that it satisfies the constraints imposed bythe particular distribution of the k information leaf nodes. In otherwords, β_(t) _(j) =(h(α_(v)[1]), . . . , h(α_(v)[m]))⊕(b₁ ^(j), . . . ,b_(m) ^(j)), where b_(i) ^(j)=0 for i ∉ {min₁, . . . , min_(q)} andb_(i) ^(j) ∈ {0,1} for i ∈ {min₁, . . . , min_(q)}. {min_(j)} are theindices of the q least reliable bits with relationα_(v)[min₁]≤α_(v)[min₂]≤ . . . ≤α_(v)[min_(q)]. PM_(t) _(j) (or PM_(t)_(j) −PM_(s)) may be calculated for each β_(t) _(j) , and r candidateswith the greatest values for PM_(t) _(j) (or PM_(t) _(j) −PM_(s)) areselected.

Although certain embodiments of the present disclosure have beendescribed in the detailed description of the present disclosure, thepresent disclosure may be modified in various forms without departingfrom the scope of the present disclosure. Thus, the scope of the presentdisclosure shall not be determined merely based on the describedembodiments, but rather determined based on the accompanying claims andequivalents thereto.

What is claimed is:
 1. An apparatus for constituent code processing inpolar successive cancellation list (SCL) decoding, comprising: aprocessor configured to: determine an activation value I and a number rof the candidate paths, where I is a binary value and r is an integer,(I, r)=ƒ(R, k, m), ƒ is a function, R is a number indicating nodereliability, k is an integer indicating a number of information nodes,and m is an integer indicating a number of leaf nodes; determine min₁,min₂, . . . , min_(q), wherein q is a number of least reliable bits;determine r candidate paths; determine path metrics PM_(t) _(j) of acodeword j for each candidate path t; and select r most probable pathsbased on PM_(t) _(j) .
 2. The apparatus of claim 1, wherein theconstituent code is an intermediate node corresponding to a constituentpolar code structure called a special node.
 3. The apparatus of claim 2,wherein the special node is a single parity check (SPC) code.
 4. Theapparatus of claim 1, wherein q is a number of least reliable bits inh(α_(v)[i]), {min_(j)} are indices of the q least reliable bits;h(α_(v)[i]) is a hard decision of α_(v)[i], α_(v) is a vector of lengthm that indicates log-likelihood ratios of node v, and i and j areintegers.
 5. The apparatus of claim 2, wherein R is characterized bynode location.
 6. The apparatus of claim 1, wherein determining min₁,min₂, . . . , min_(q) is comprised of determining min₁, min₂, . . . ,min_(q) based on α_(v), wherein α_(v)[min₁]≤α_(v)[min₂]≤ . . .≤α_(v)[min_(q)].
 7. The apparatus of claim 1, wherein q are minimumelements found in |α_(v)|.
 8. The apparatus of claim 1, wherein apotential codeword j of node v is obtained by flipping binary values ofcombinations of q least reliable bits in h(α_(v)[i]) based on α_(v) suchthat a constraint imposed by a distribution of the k information nodesis satisfied.
 9. The apparatus of claim 1, wherein a path metric PM_(t)of the candidate path t isPM_(t)=PM_(s)−Σ_(i)|β_(t)[i]−h(α_(v)[i])|×|α_(v)[i]|, where PM_(s) is anincoming path metric, β_(t) is a candidate codeword of node v, andPM_(t) is a reliability of candidate path t.
 10. The apparatus of claim1, wherein I is determined based on location of a node.
 11. A method ofconstituent code processing for polar successive cancellation list (SCL)decoding, comprising: determining an activation value I and a number rof the candidate paths, where I is a binary value and r is an integer,(I, r)=ƒ(R, k, m), ƒ is a function, R is a number indicating nodereliability, k is an integer indicating a number of information nodes,and m is an integer indicating a number of leaf nodes; determining min₁,min₂, . . . , min_(q), wherein q is a number of least reliable bits;determining r candidate paths; determining path metrics PM_(t) _(j) of acodeword j for each candidate path t; and selecting r most probablepaths based on PM_(t) _(j) .
 12. The method of claim 11, wherein theconstituent code is an intermediate node corresponding to a constituentpolar code structure called a special node.
 13. The method of claim 12,wherein the special node is a single parity check (SPC) code.
 14. Themethod of claim 11, wherein q is a number of least reliable bits inh(α_(v)[i]), {min_(j)} are indices of the q least reliable bits;h(α_(v)[i]) is a hard decision of α_(v)[i], α_(v) is a vector of lengthm that indicates log-likelihood ratios of node v, and i and j areintegers.
 15. The method of claim 12, wherein R is characterized by nodelocation.
 16. The method of claim 11, wherein determining min₁, min₂, .. . , min_(q) is comprised of determining min₁, min₂, . . . , min_(q)based on α_(v), wherein α_(v)[min₁]≤α_(v)[min₂]≤ . . . ≤α_(v)[min_(q)].17. The method of claim 11, wherein q are minimum elements found in|α_(v)|.
 18. The method of claim 11, wherein a potential codeword j ofnode v is obtained by flipping binary values of combinations of q leastreliable bits in h(α_(v)[i]) based on α_(v) such that a constraintimposed by a distribution of the k information nodes is satisfied. 19.The method of claim 11, wherein a path metric PM_(t) of the candidatepath t is PM_(t)=PM_(s)−Σ_(i)|β_(t)[i]−h(α_(v)[i])|×|α_(v)[i]|, wherePM_(s) is an incoming path metric, β_(t) is a candidate codeword of nodev, and PM_(t) is a reliability of candidate path t.
 20. The method ofclaim 11, wherein I is determined based on location of a node.